Admissibility in Games with Imperfect Information∗
نویسندگان
چکیده
In this invited paper, we study the concept of admissible strategies for two player win/lose infinite sequential games with imperfect information. We show that in stark contrast with the perfect information variant, admissible strategies are only guaranteed to exist when players have objectives that are closed sets. As a consequence, we also study decision problems related to the existence of admissible strategies for regular games as well as finite duration games. 1998 ACM Subject Classification F.1.1 Models of Computation, B.1.2 [Automatic Synthesis] Formal Models
منابع مشابه
CDMA systems in fading channels: Admissibility, network capacity, and power control
We study the admissibility and network capacity of imperfect power-controlled Code-Division Multiple Access (CDMA) systems with linear receivers in fading environments. In a CDMA system, a set of users is admissible if their simultaneous transmission does not result in violation of any of their Quality-of-Service (QoS) requirements; the network capacity is the maximum number of admissible users...
متن کاملAdmissibility in Infinite Games
We analyse the notion of iterated admissibility, i.e., avoidance of weakly dominated strategies, as a solution concept for extensive games of infinite horizon. This concept is known to provide a valuable criterion for selecting among multiple equilibria and to yield sharp predictions in finite games. However, generalisations to the infinite are inherently problematic, due to unbounded dominance...
متن کاملOn the Power of Imperfect Information
We present a polynomial-time reduction from parity games with imperfect information to safety games with imperfect information. Similar reductions for games with perfect information typically increase the game size exponentially. Our construction avoids such a blow-up by using imperfect information to realise succinct counters which cover a range exponentially larger than their size. In particu...
متن کامل2 O N the P Ower of I Mperfect I Nformation
We present a polynomial-time reduction from parity games with imperfect information to safety games with imperfect information. Similar reductions for games with perfect information typically increase the game size exponentially. Our construction avoids such a blow-up by using imperfect information to realise succinct counters which cover a range exponentially larger than their size. In particu...
متن کاملOpacity Issues in Games with Imperfect Information
We study in depth the class of games with opacity condition, which are two-player games with imperfect information in which one of the players only has imperfect information, and where the winning condition relies on the information he has along the play. Those games are relevant for security aspects of computing systems: a play is opaque whenever the player who has imperfect information never ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017